首页> 外文OA文献 >The RKHS Approach to Minimum Variance Estimation Revisited: Variance Bounds, Sufficient Statistics, and Exponential Families
【2h】

The RKHS Approach to Minimum Variance Estimation Revisited: Variance Bounds, Sufficient Statistics, and Exponential Families

机译:重新评估最小方差估计的RKHs方法:方差   界限,足够的统计数据和指数族

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。
获取外文期刊封面目录资料

摘要

The mathematical theory of reproducing kernel Hilbert spaces (RKHS) providespowerful tools for minimum variance estimation (MVE) problems. Here, we extendthe classical RKHS based analysis of MVE in several directions. We develop ageometric formulation of five known lower bounds on the estimator variance(Barankin bound, Cramer-Rao bound, constrained Cramer-Rao bound, Bhattacharyyabound, and Hammersley-Chapman-Robbins bound) in terms of orthogonal projectionsonto a subspace of the RKHS associated with a given MVE problem. We show that,under mild conditions, the Barankin bound (the tightest possible lower bound onthe estimator variance) is a lower semicontinuous function of the parametervector. We also show that the RKHS associated with an MVE problem remainsunchanged if the observation is replaced by a sufficient statistic. Finally,for MVE problems conforming to an exponential family of distributions, wederive novel closed-form lower bound on the estimator variance and show that areduction of the parameter set leaves the minimum achievable varianceunchanged.
机译:再现内核希尔伯特空间(RKHS)的数学理论为最小方差估计(MVE)问题提供了强大的工具。在这里,我们在几个方向上扩展了基于RKHS的MVE的经典分析。我们根据正交投影到与RKHS相关的子空间上的估计量方差(Barankin界,Cramer-Rao界,约束Cramer-Rao界,Bhattacharyyabound和Hammersley-Chapman-Robbins界)开发了五个已知下界的年龄度量公式。给定的MVE问题。我们表明,在温和条件下,Barankin边界(估计变量方差的最严格下限)是参数向量的下半连续函数。我们还表明,如果将观察值替换为足够的统计量,则与MVE问题相关的RKHS仍保持不变。最后,对于符合指数分布的MVE问题,在估计方差上采用了新颖的闭式下界形式,并表明参数集的归约使得最小可实现方差保持不变。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号